#def is_prime(num):
#    if num < 2:
 #       return False
  #  for i in range(2, int(num ** 0.5) + 1):
   #     if num % i == 0:
    #        return False
   # return True

#M = int(input("请输入区间下限M："))
#N = int(input("请输入区间上限N："))

#primes = []
#count = 0
#sum_primes = 0

#for num in range(M, N + 1):
 #   if is_prime(num):
  #      primes.append(str(num))
   #     count += 1
    #    sum_primes += num

#print("区间内的素数：" + ",".join(primes))
#print("素数个数：", count)
#print("素数之和：", sum_primes)

n = eval(input("请输入一个整数"))
for i in range(2,n):
    if n % i == 0:
        print("{}不是素数".format(n))
        break
else:
    print("{}是素数".format(n))